Stochastic Packing Integer Programs with Few Queries
نویسندگان
چکیده
We consider a stochastic variant of the integer linear programming problem, which contains random variables in the objective vector. We are allowed to reveal each entry of the objective vector by conducting a query, and the task is to find a good solution by conducting a small number of queries. We propose adaptive and nonadaptive algorithms for this problem, and provide a general technique for analyzing the performance of the algorithms. We also demonstrate our framework by applying it to a variety of stochastic combinatorial optimization problems such as matching, matroid, and stable set problems. Supported by JSPS KAKENHI Grant Number 16K16011. Email: [email protected] Supported by JSPS KAKENHI Grant Number 16H06931 and JST ACT-I Grant Number JPMJPR16UR. Email: yutaro [email protected]
منابع مشابه
X Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries
The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic k-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably...
متن کاملStochastic Programming with Simple Integer Recourse
Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs. Analytical as well as computational properties of the expected recourse funct...
متن کاملAlgorithms to Approximate Column-Sparse Packing Problems
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation algorithms for some well-known families of such problems. As three main examples, we attain the integrality gap, up to lower-order terms, for known LP relaxat...
متن کاملBranch and Price for Chance Constrained Bin Packing
This article considers two versions of the stochastic bin packing problem with chance constraints. In the first version, we formulate the problem as a two-stage stochastic integer program that considers item-tobin allocation decisions in the context of chance constraints on total item size within the bins. Next, we describe a distributionally robust formulation of the problem that assumes the i...
متن کاملTruthful Unification Framework for Approximating Packing Integer Programs with Choices∗
One of the most interesting research directions within the field of algorithmic mechanism design revolves the study of hard combinatorial optimization problems. In this setting, many common techniques, which are broadly used by approximation algorithms, cannot be utilized as they violate certain monotonicity properties that are imperative for truthfulness. Consequently, it seems of the essence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018